Decomposition Matrices are Generically Trivial

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Generically Trivial Case ( Lecture 11 )

Throughout this lecture, we let k denote an algebraically closed field, a prime number which is invertible in k. Let X be an algebraic curve over k, G a smooth affine group scheme over X whose generic fiber is semisimple and simply connected. Our goal, over the next several lectures, is to prove the following result: Theorem 1. Let R be a finitely generated k-algebra, let P be a G-bundle over t...

متن کامل

How many sorting equilibria are there ( generically ) ? ∗

It is shown that in a generic two-jurisdiction model of the type introduced by Caplin and Nalebuff (1997), the number of sorting equilibria (with jurisdictions providing distinct policies) is finite and even.

متن کامل

Non-trivial 2d Space-times from Matrices

Solutions of matrix quantum mechanics have been shown to describe time dependent backgrounds in the holographically dual two dimensional closed string theory. We review some recent work dealing with non-trivial space-times which arise in this fashion and discuss aspects of physical phenomena in them. Based on talk at “International Workshop on String Theory”, Khajuraho, December 2004.

متن کامل

Elections Are Conceptually Trivial

After everyone has voted, the votes in each ballot position are counted, and the winner of each race is declared. Barring the use of some form of ranked-preference ballot, the algorithms required are hardly more than mere summations. What makes elections difficult is the problem of performing this summation over a canvassing hierarchy spanning many polling places and local election offices, whe...

متن کامل

Symmetric Orthogonal Tensor Decomposition is Trivial

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued, pairwise orthogonal vectors. Such decompositions do not generally exist, but we show that some symmetric tensor decomposition problems can be converted to orthogonal problems following the whitening procedure proposed by Anandkumar et al. (2012). If an orthogonal decomposition of a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2015

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnv204